Free view generation in ray-space

ABSTRACT

The claimed subject matter relates to an architecture that can facilitate more efficient free view generation in Ray-Space by way of a Radon transform. The architecture can render virtual views based upon original image data by employing Ray-Space interpolation techniques. In particular, the architecture can apply the Radon transform to a feature epipolar plane image (FEPI) to extract more suitable slope or direction candidates. In addition, the architecture can facilitate improved block-based matching techniques in order to determine an optimal linear interpretation direction.

TECHNICAL FIELD

The present disclosure relates generally to free view generation inRay-Space, and more particularly to constructing arbitrary virtual viewsbased upon Ray-Space interpolation techniques.

BACKGROUND

Ray-Space is one of the representation forms of 3D scenes that focuseson straight line rays passing through a 3D space. Rays in Ray-Space arecommonly represented by five parameters: a position (x,y,z), and theray's direction (θ,φ). However, these five parameters can be reduced tofour parameters with a position (x,y) at which a ray passes through areference plane z=0. According to the Ray-Space concept, acquisition ofa view image is a process of sampling and recording ray data from raysthat pass through a camera lens. The recorded rays correspond to a 2Dsubspace of the whole Ray-Space.

The concept of Free Viewpoint Television (FTV), whereby a user canmanipulate the viewpoint of a scene displayed by an FTV enabled device,relies upon Ray-Space modeling. However, because it is not practical tocapture a scene from every possible camera location (e.g., focal point)that a user might choose with an FTV enabled device, FTV thereforerelies on Ray-Space interpolation to generate ray data absent from theRay-Space. Such absent data typically corresponds to gaps in the imagedata for which no camera actually imaged a real view. Accordingly, theviews for which no real image data exist must be virtually generated,customarily by Ray-Space interpolation techniques. Unfortunately,conventional Ray-Space interpolation techniques produce numerousmatching errors and do not provide acceptable rendered views withoutadvance knowledge of the scene. Having advanced knowledge of a scene isgenerally infeasible, especially in applications such as FTV.

SUMMARY

The following presents a simplified summary of the claimed subjectmatter in order to provide a basic understanding of some aspects of theclaimed subject matter. This summary is not an extensive overview of theclaimed subject matter. It is intended to neither identify key orcritical elements of the claimed subject matter nor delineate the scopeof the claimed subject matter. Its sole purpose is to present someconcepts of the claimed subject matter in a simplified form as a preludeto the more detailed description that is presented later.

The subject matter disclosed and claimed herein, in one or more portionsthereof, comprises an architecture that can facilitate more efficientfree view generation in Ray-Space by way of a Radon transform. Inaccordance therewith and to other related ends, the architecture canextract a set of feature points from an epipolar plane image (EPI), andcan further construct a feature epipolar plane image (FEPI) based uponthe extracted set of feature points. Generally, a feature pointcorresponds to a scene point in an image (and can be represented by aparticular pixel in the image data), but is represented by a line in theFEPI. Ray-Space interpolation typically requires determining a slope ofthat line in order to provide accurate results. Thus, the architecturecan apply a Radon transform to the FEPI in order to limit members of aset of candidate interpolation slopes. In particular, the Radontransform can eliminate from the candidate set many possible (butincorrect) slopes such that determining the slope of the line iscommensurately simplified.

In a portion of the claimed subject matter, the architecture can examineoriginal image data in order to construct the EPI as well as theRay-Space. The EPI can be constructed by stacking together each line ina single epipolar plane. In the EPI, a scene point from the image can berepresented by a line in which the slope of the line is an inverse of adepth of the scene point. The Ray-Space can be constructed byexamination of the image data in connection with certain cameraparameters.

Additionally or alternatively, the architecture can provide a variety oftechniques to aid in determining the slope of the line. Once suchtechnique can be provided by employing an intensity function to selectfeature points when constructing the FEPI. As another example, thearchitecture can provide a local maximum peak constraint by which falsepeaks often associated with noise in the original image can besuppressed during the Radon transform. As yet another example, the setof candidate interpolation slopes can be substantially reduced byextracting a maximum of N peaks, where N can be a median average offeature points per row for the EPI. Further still, the architecture canprovide an improved block matching interpolation (BMI)-based techniquethat can further leverage the benefits of the Radon transform.

The following description and the annexed drawings set forth in detailcertain illustrative aspects of the claimed subject matter. Theseaspects are indicative, however, of but a few of the various ways inwhich the principles of the claimed subject matter may be employed andthe claimed subject matter is intended to include all such aspects andtheir equivalents. Other advantages and distinguishing features of theclaimed subject matter will become apparent from the following detaileddescription of the claimed subject matter when considered in conjunctionwith the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a block diagram of a system that can facilitate moreefficient free view generation in Ray-Space by way of a Radon transform.

FIG. 2 illustrates a block diagram of a system for constructing an EPI.

FIG. 3 depicts a single camera system for capturing images of a scene.

FIG. 4 illustrates an example camera array topology.

FIG. 5 is an exemplary chart that illustrates various aspects,constraints and/or relationships in connection with epipolar geometry.

FIG. 6A illustrates a block diagram of a system that can provide variousimprovements and features associated with facilitating more efficientfree view generation in Ray-Space.

FIG. 6B is an example illustration of a Radon transform.

FIG. 7 depicts an exemplary flow chart of procedures that define amethod for facilitating free view generation in Ray-Space in a moreproficient manner by employing a Radon transform

FIG. 8 illustrates an exemplary flow chart of procedures that define amethod for constructing an EPI and/or constructing an enhanced FEPI.

FIG. 9 depicts an exemplary flow chart of procedures defining a methodfor providing additional features with respect to limiting a candidateset of directions.

FIG. 10 is an exemplary flow chart of procedures defining a method forproviding an enhanced block matching technique for facilitating aninterpolated virtual view.

FIG. 11 illustrates a block diagram of a computer operable to executethe disclosed architecture.

FIG. 12 illustrates a schematic block diagram of an exemplary computingenvironment.

DETAILED DESCRIPTION

The claimed subject matter is now described with reference to thedrawings, wherein like reference numerals are used to refer to likeelements throughout. In the following description, for purposes ofexplanation, numerous specific details are set forth in order to providea thorough understanding of the claimed subject matter. It may beevident, however, that the claimed subject matter may be practicedwithout these specific details. In other instances, well-knownstructures and devices are shown in block diagram form in order tofacilitate describing the claimed subject matter.

As used in this application, the terms “component,” “module,” “system,”or the like can, but need not, refer to a computer-related entity,either hardware, a combination of hardware and software, software, orsoftware in execution. For example, a component might be, but is notlimited to being, a process running on a processor, a processor, anobject, an executable, a thread of execution, a program, and/or acomputer. By way of illustration, both an application running on acontroller and the controller can be a component. One or more componentsmay reside within a process and/or thread of execution and a componentmay be localized on one computer and/or distributed between two or morecomputers.

Furthermore, the claimed subject matter may be implemented as a method,apparatus, or article of manufacture using standard programming and/orengineering techniques to produce software, firmware, hardware, or anycombination thereof to control a computer to implement the disclosedsubject matter. The term “article of manufacture” as used herein isintended to encompass a computer program accessible from anycomputer-readable device, carrier, or media. For example, computerreadable media can include but are not limited to magnetic storagedevices (e.g., hard disk, floppy disk, magnetic strips . . . ), opticaldisks (e.g. compact disk (CD), digital versatile disk (DVD) . . . ),smart cards, and flash memory devices (e.g. card, stick, key drive . . .). Additionally it should be appreciated that a carrier wave can beemployed to carry computer-readable electronic data such as those usedin transmitting and receiving electronic mail or in accessing a networksuch as the Internet or a local area network (LAN). Of course, thoseskilled in the art will recognize many modifications may be made to thisconfiguration without departing from the scope or spirit of the claimedsubject matter.

Moreover, the word “exemplary” is used herein to mean serving as anexample, instance, or illustration. Any aspect or design describedherein as “exemplary” is not necessarily to be construed as preferred oradvantageous over other aspects or designs. Rather, use of the wordexemplary is intended to present concepts in a concrete fashion. As usedin this application, the term “or” is intended to mean an inclusive “or”rather than an exclusive “or.” Therefore, unless specified otherwise, orclear from context, “X employs A or B” is intended to mean any of thenatural inclusive permutations. That is, if X employs A; X employs B; orX employs both A and B, then “X employs A or B” is satisfied under anyof the foregoing instances. In addition, the articles “a” and “an” asused in this application and the appended claims should generally beconstrued to mean “one or more” unless specified otherwise or clear fromcontext to be directed to a singular form.

As used herein, the terms “infer” or “inference” generally refer to theprocess of reasoning about or inferring states of the system,environment, and/or user from a set of observations as captured viaevents and/or data. Inference can be employed to identify a specificcontext or action, or can generate a probability distribution overstates, for example. The inference can be probabilistic—that is, thecomputation of a probability distribution over states of interest basedon a consideration of data and events. Inference can also refer totechniques employed for composing higher-level events from a set ofevents and/or data. Such inference results in the construction of newevents or actions from a set of observed events and/or stored eventdata, whether or not the events are correlated in close temporalproximity, and whether the events and data come from one or severalevent and data sources.

The terms “slope” and “direction” are used substantially interchangeablyherein, whether in Cartesian space, Polar space, or discussing a scalaror vector. Generally, slope and direction can refer to a directionalcomponent or parameter of a line.

Referring now to the drawings, with reference initially to FIG. 1,system 100 that can facilitate more efficient free view generation inRay-Space by way of a Radon transform is depicted. Generally, system 100can include feature extractor component 102 that can extract a set offeature points, denoted herein as feature point(s) 104 whether referringto an individual feature point 104 or a collection or set of featurepoints 104. Feature extractor component 102 can extract feature points104 from an epipolar plane image (EPI), various aspects of which arefurther detailed infra, particularly with reference to FIGS. 2-5.However, briefly, an EPI can be generated from one or more images, forexample digital or encoded images or video of a scene.

Accordingly, a given feature point 104 can correspond to a particularfeature or scene point in an image of the scene, which can berepresented by one or more pixels in the image, yet represented in anEPI as a line. Hence, any point in a real scene can be represented in animage of that scene as a pixel and further represented in an EPI as aline. Based upon the extracted set of feature points 104, featureextractor component 102 can construct a feature epipolar plane image(FEPI) 106. FEPI 106 can be similar to an EPI, but whereas the EPI caninclude a line for each pixel of an image, FEPI 106 can include onlylines that correspond to feature points 104.

Additionally, system 100 can include interpolation component 108 thatcan receive FEPI 106 from feature extractor component 102 or fromanother component. Interpolation component 108 can apply a Radontransform to FEPI 106 in order to determine a slope of a line. Inparticular, according to an aspect of the claimed subject matter, theRadon transform applied to FEPI 106 can be employed to limit members ofa set of candidate interpolation slopes. In more detail, Ray-Space iscomposed of straight lines with different slopes. A primary objective ofRay-Space interpolation is to determine the respective slopes of thosestraight lines. Thus, when interpolating a line (which can be derivedfrom feature point 104 that can correspond to a pixel in an image),wherein the line is included in FEPI 106, the slope of the linegenerally must be determined. By reducing the number of possible slopesthe line can follow, the task of determining a correct slope for theline can be commensurately simplified. And, as noted, the Radontransform can be employed by interpolation component 108 to reduce thenumber of possible slopes, which can improve speed and/or efficiency ofRay-Space interpolation and can also improve a rendered result ofRay-Space interpolation.

As an example application, Ray-Space interpolation is one of the keytechnologies employed to generate arbitrary viewpoint images. Arbitraryviewpoint images can be rendered from source data that captures realviews of a scene, and used to interpolate the arbitrary view, or onethat is from a different perspective or vantage point (e.g. viewpoint orfocal point). Arbitrary viewpoint images can be employed to implement,for example, a Free Viewpoint Television (FTV) system. FTV can trulychange the paradigm for television and other viewing experiences byenabling a user to choose the viewpoint within a scene freely. Thus, agiven point of view of an image need not remain static, but can befreely manipulated by the user just as a real observer could view ascene from different focal points by changing locations (e.g., changingthe direction of view) or by moving closer or farther away (e.g. zoomin/out). The broad concept of FTV is known as is application of theRay-Space method utilized to implement FTV. Aspects of these and otherconcepts can be better understood with reference to FIG. 2.

Before continuing the description of FIG. 1, FIGS. 2-5 can now bereferenced in conjunction with FIG. 1. Turning now to FIG. 2, system 200can be found, which relates to constructing an EPI. In general, system200 can include virtualization component 216 that can receive a set ofimages 204, wherein each image 204 from the set can depict real scene202 from a disparate focal point along an associated optical axis.Appreciably, virtualization component 216 can receive the images fromimage data store 212. In order to provide clear understanding, asimplified example of some of the concepts provided herein can be foundwith reference to FIG. 3.

While still referencing FIGS. 1 and 2, but turning briefly to FIG. 3,system 300 illustrates a single camera for capturing images of a scene.Depicted here is camera 302 that can image a real scene, such as scene202 from FIG. 2. The position of camera 302 when a scene is recorded toan image can be referred to as focal point 304, whereas the direction ofthe lens of the camera can be referred to as optical axis 306.Appreciably image data can be stored to image data store 212, includingthe pixel data as well as camera parameters (e.g., position, direction,time, camera index number . . . ) and/or certain metadata.

Thus, referring back to FIG. 2, various aspects can now be more readilyunderstood. In this case, scene 202 is a real view of a building from aparticular location or focal point (e.g. focal point 304). If anobserver snapped a photograph of the building from that particularlocation, then image 204 ₁ would result, which is an image of scene 202from a first focal point. Next, by moving to a nearby position andsnapping a second photograph, image 204 ₂ will result, which is an imageof scene 202 from a second focal point. Data for both images can bestored to image data store 212.

Based upon image data (e.g., from images 204 ₁ and 204 ₂, et al.) inassociation with camera parameters the Ray-Space can be constructed.Ray-Space is a virtual representation of a 3D scene that focuses onrays, or straight lines passing through the 3D space. In practice, imagedata typically comes from more than one camera exemplified in FIG. 3.Rather, the Ray-Space method customarily involves large camera arrays,wherein each camera images a scene from a different focal point.However, even with camera arrays, with many cameras situated veryclosely together, the ray data obtained with realistic camera intervalis still too sparse in viewpoint axis to apply the Ray-Space method.Accordingly, Ray-Space interpolation is necessary to generate the absentray data to facilitate feasibility for applications such as aRay-Space-based FTV. Put another way, since it is normally notconceivable to image every possible view of a scene or enough views ofthe scene for FTV or other applications, arbitrary viewpoint images mustbe constructed when, e.g., a user selects a viewpoint for which anassociated real view was not actually imaged.

Thus, assuming image 204 ₂ was captured from a focal point that is, say,20 paces to the right of the focal point for image 204 ₁, then theRay-Space for these two focal points is well-defined. However, for afocal point that is midway between the focal points of images 204 ₁ and204 ₂, Ray-Space interpolation can be employed and would typicallyutilize the two nearest neighboring views to generate the virtual view,in this case images 204 ₁ and 204 ₂. In an aspect of the claimed subjectmatter, an assumption is made as to certain camera parameters, which isgraphically illustrated in FIG. 4.

Still referencing FIGS. 1 and 2, but referring as well to FIG. 4,example camera array topology 400 is provided. It was noted supra thatvirtualization component 216 can receive a set of images (e.g., images204 ₁, 204 ₂ . . . ), wherein each image respectively depicts a scenefrom a disparate focal point (e.g., focal point 304) along an associatedoptical axis (e.g., optical axis 306). As a general assumption, itshould be noted that each optical axis 306 can be perpendicular tobaseline 402, wherein baseline 402 includes each focal point 304.Moreover, each optical axis 306, in addition to being perpendicular tobaseline 402 is parallel to other optical axes 306. Illustrated inexample topology 400 are N−1 focal points 304, specifically, focalpoints 304 ₁, 304 ₂ . . . 304 _(N), all of which lie upon baseline 402.In addition, topology 400 depicts N−1 optical axes, one for each focalpoint 304, specifically, optical axis 306 ₁, 306 ₂ . . . 306 _(N), allof which are perpendicular to baseline 402 and parallel to one another.It should be appreciated that topology 400 can apply to both a singlecamera that changes locations or to an array of cameras. In addition,focal point 404 with associated optical axis 406 is inserted toillustrate an arbitrarily selected viewpoint that is not imaged by acamera and must be interpolated, generally based upon the twoneighboring views; in this case the views provided by cameras situatedat focal points 304 ₁ and 304 ₂.

Under the above topology constraint, epipolar lines (described infra)can be aligned with image rows. Hence, the epipolar lines included in asingle epipolar plane can be stacked together to form EPI 218.Accordingly, virtualization component 216 can aggregate a set ofepipolar lines included in a single epipolar plane in order to constructEPI 218. Furthermore, given topology 400, a single scene point maps to astraight line in EPI 218 with the slope representing the inverse depthof the scene point. Thus, in an aspect of the claimed subject matter,virtualization component 216 can map the scene point to the line,wherein the slope of the line can represent an inverse of the depth ofthe scene point, whereby the depth can be a measure of distance from afocal point to the scene point.

Thus, any given scene point in an image, for example, the scene pointdenoted by reference numeral 208 can be mapped to a line in EPI 218. Ofcourse, scene point 208 has a corresponding element in real scene 202,which is denoted by reference numeral 210. And scene point 208 can berepresented by pixel 214 that can be included in image data stored toimage data store 212. Returning to FIG. 1, if scene point 208 is deemedto represent a feature point (and the associated line is extracted fromEPI 218 by feature extractor component 102), then the associated lineincluded in EPI 218 can also be included in FEPI 106. In practice,corners, junctures, or other attributes identified by edge-detectiontechniques are often selected as feature points. Accordingly, a line inEPI 218 that represents scene point 208, which in turn represents acorner of the building foundation (e.g., location 210 in scene 202), isa likely candidate for feature extractor component 102 to extract asfeature point 104.

In accordance with the foregoing, for each interpolated point,corresponding pixels along a reference direction in the neighboringcaptured views can be employed to perform linear interpolation. As aresult, determining the slope of the lines is main issue in Ray-Spaceinterpolation, which can be provided by interpolation component 108 asdescribed herein. Conventionally, pixel matching interpolation (PMI)methods and block matching interpolation (BMI) methods have beensuggested. These methods seek to find the correspondence fromneighboring viewpoint image with a minimum mean square error (MSE)criterion. However, an existing difficulty with conventional BMI and PMImethods is that it is very difficult to preset a search range to meetdifferent situations. Moreover, in the large search range case, for apixel to be interpolated, it is likely that an incorrect matching paircan yield a smaller MSE than the true pair. Thus, the incorrect matchingpair will be selected rather than the true pair. Other Ray-Spaceinterpolation schemes are known that are based on adaptive filtering. Inthese schemes, a set of filters is prepared a priori, with each filterapplying to a different direction. For a pixel that is to beinterpolated, the neighboring area of the pixel is analyzed and the bestfilter is determined. Unfortunately, it is difficult for the predefinedfilters to adapt to varying scenes. Experimental results from theadaptive filtering schemes show that the interpolation performance isgreatly determined by the filter set. Accordingly, the claimed subjectmatter can provide readily apparent benefits and fulfill a market needin that the disclosed virtual view point image generation can providemuch higher quality than images produced by traditional PMI, BMI orother interpolation schemes.

For the sake of completeness, it mentioned that system 100 can includeall or portions of system 200 described in connection with FIG. 2.Moreover, system 100 can also include or be operatively connected todata store 110. Data store 110 is intended to be a repository of all orportions of data, data sets, or information described herein orotherwise suitable for use with the claimed subject matter. Thus,although depicted as distinct components data store 110 can include allor portions of image data store 212. Data store 110 can be centralized,either remotely or locally cached, or distributed, potentially acrossmultiple devices and/or schemas. Furthermore, data store 110 can beembodied as substantially any type of memory, including but not limitedto volatile or non-volatile, sequential access, structured access, orrandom access and so on. It should be understood that all or portions ofdata store 110 can be included in system 100, or can reside in part orentirely remotely from system 100. Furthermore, also for the sake ofclear understanding, a brief description of certain relevant featuresregarding epipolar geometry can be provided with reference to FIG. 5.

Turning now to FIG. 5, an exemplary chart 500 that illustrates variousaspects, constraints, and/or relationships in connection with epipolargeometry is provided. Epipolar geometry refers to the geometry of stereovision. When two cameras view a 3D scene from two distinct positions,there are a number of geometric relations between the 3D points andtheir projections onto 2D images that, for example, lead to constraintsbetween the image points. These relations are derived based on theassumption that the cameras can be sufficiently well approximated by thepinhole camera model.

Chart 500 is a geometrical representation of two pinhole cameras lookingat the same point from different focal points, denoted as 304 ₁ and 304₂. In this example, the point at which both cameras focus is point 210from real scene 202, which is represented by scene point 208. It shouldbe appreciated that in real cameras, the image plane is actually behindthe focal point, and produces a rotated image. With pinholeapproximation, however, this projection difficulty is simplified byplacing a virtual image plane in front of the focal point of each camerato produce a non-rotated image. As mentioned, 304 ₁ and 304 ₂ representthe focal points of the two cameras. Portion 210 is the point ofinterest included in scene 202 for both cameras. 502 ₁ represents thevirtual image plane for the left camera, while 502 ₂ is the virtualimage plane for the camera on the right side of chart 500. Points 208 ₁and 208 ₂ are the projections of point 210 onto each respective imageplane.

Each camera captures a 2D image of the 3D world. This conversion from 3Dto 2D is referred to as a perspective projection and is described by thepinhole camera model. It is common to model this projection operation byrays that emanate from the camera, passing through its focal point. Itshould be understood that each emanating ray corresponds to a singlepoint in the image.

Since the two focal points, 304 ₁ and 304 ₂, of the cameras aredistinct, each focal point is projected onto a distinct point into theother camera's image plane (e.g., image planes 502 ₁ and 502 ₁). Thesetwo projected image points are denoted by 208 ₁ and 208 ₂, and arecalled epipoles. Appreciably, epipole 208 ₁ and focal point 304 ₁ lie ona single line within image plane 502 ₁, as does epipole 208 ₂ and focalpoint 304 ₂ in its associated image plane 502 ₂.

The line 304 ₁ to 210 is seen by the left camera as a point because itis directly in line with that camera's pinhole optical axis. However,the right camera sees this line as a line in image plane 502 ₂ ratherthan a point. Such a line (denoted 510) passes through 208 ₂ and 508 ₂in the right camera and is called an epipolar line. Symmetrically, theline 304 ₂ to 210 is seen by the right camera as a point, yet seen as anepipolar line by the left camera.

As an alternative visualization, consider the points 210, 304 ₁ and 304₂ that form a plane called the epipolar plane. The epipolar planeintersects each camera's image plane (e.g., 502 ₁ and 502 ₁) where itforms lines—the epipolar lines. The epipolar lines in the right imagemust intersect the right epipole independent of how point 210 is chosen(e.g., 210 a or 210 b would be the same point for the left camera, butnot for the right camera), and correspondingly for the left image.

With these visualizations explained certain epipolar constraints andtriangulations become apparent. If the translation and rotation of onecamera relative to the other is known, the corresponding epipolargeometry leads to two important observations: First, if the projectionpoint 208 ₁ is known, then its projection line 304 ₁ to 208 ₁ is knownand, consequently, also the epipolar line 510 is known, even though 208₂ is unknown. However, it must then be the case that the projection of210 in right image plane 502 ₂, 208 ₂, lies on this particular epipolarline. This means that for each point in one image the correspondingpoint in the other image must lie on a known epipolar line. Thisprovides an epipolar constraint which corresponding image points mustsatisfy and it means that it is possible to test if two points reallycorrespond to the same 3D point. Epipolar constrains can in a convenientway be described by the essential matrix or the fundamental matrixrelated to the two cameras.

If the points 208 ₁ and 208 ₂ are known, their projection lines are alsoknown. If the two image points really correspond to the same 3D point,210, the projection lines must intersect precisely at 210. This meansthat 210 can be calculated from the coordinates of the two image points,a process called triangulation.

With the foregoing in mind, it is readily apparent why epipolar geometryis employed with interpolation schemes, why a line in an epipolar planeimage can represent an inverse depth, and also apparent why successfulRay-Space interpolation often reduces to an exercise in determining aslope of a line in an epipolar plane image such as EPI 218. This can bea non-trivial task, but the Radon transform applied by interpolationcomponent 108 can simply this task appreciably. Further details withrespect to Ray-Space, Ray-Space interpolation, and Radon transforms canbe found infra in connection with FIGS. 6A and 6B.

With reference now to FIGS. 6A and 6B, FIG. 6A illustrates system 600with various improvements and features that can facilitate moreefficient Ray-Space interpolation and/or free view generation inRay-Space by way of a Radon transform, an example of which is depictedin FIG. 6B. As detailed supra, in Ray-Space representation, one ray in3D real space can be represented by one point in the Ray-Space. TheRay-Space is a virtual space; however, it can be directly connected toor representative of the real space. The Ray-Space is generated easilyby collecting multi-view images (e.g., set of images 602 with each imagedepicting a scene from a different focal point, which can be received byvirtualization component 216) with the consideration of cameraparameters. For example, let (x,y,z) be three space coordinates and(θ,φ) be the parameters of direction. A ray going through space can beuniquely parameterized by its location (x,y,z) and the direction (θ,φ);in other words, a ray can be mapped to a point in this 5D ray parameterspace. In this ray parameter space, a function, ƒ, can be introducedwhose value corresponds to the intensity of the specified ray. Thus, allthe intensity data of rays can be expressed by:

ƒ(x,y,z;θ,φ),−π≦θ<π,−π/2≦φ<π/2  (1)

For rays that arrive at a reference plane, the dimension of parameterspace can be reduced from the original 5D function to a 4D function,ƒ(x,y,θ,φ), where (x,y) can denote the intersection of the ray and thereference plane z=0, where (θ,φ) can be the direction of the ray, andwhere ƒ(x,y,θ,φ) can represent the intensity of the ray. For simplicity,3D Ray-Space ƒ(x,y,u=tan θ) without the vertical disparity φ isconsidered here. The ƒ(x,u) with respect to the same scan line ofdifferent viewpoint images can be extracted by virtualization component216 to compose EPI 218. In an aspect of the claimed subject matter,virtualization component 216 can further include or be communicativelycoupled to Gaussian filter 604. Thus, virtualization component 216 canapply Gaussian filtering to the received set of images 602 in order tosmooth the original images 602 or to minimize or reduce noise effectsprior to constructing EPI 218.

In addition to virtualization component 216, system 600 can also includefeature extractor component 102 and interpolation component 108. Featureextractor component 102 can extract feature points 104 from EPI 218 andemploy feature points 104 to create FEPI 106; while interpolationcomponent 108 can receive FEPI 106 and apply Radon transform 610 to FEPI106 in order to facilitate determination of a slope of a line in FEPI106 as substantially described in connection with FIG. 1 and with a morerobust feature set described herein.

As mentioned previously, in Ray-Space interpolation, the maincomputational task presented is to find the slope of the straight linesin an EPI, such as EPI 218. Due to the inherent properties, Radontransform 610 can be a useful tool to capture the directionalinformation contained in images 602 and included by proxy in FEPI 106.Radon transform 610 describes a function in terms of (integral)projections. With reference to FIG. 6B, which depicts an example Radontransform 610, Radon transform 610 of a 2D function, ƒ(x,u), can bedefined as:

$\begin{matrix}{{{R\left( {\rho,\theta} \right)}\left\lbrack {f\left( {x,u} \right)} \right\rbrack} = {\int_{- \infty}^{\infty}{\int_{- \infty}^{\infty}{{f\left( {x,u} \right)}{\delta \left( {\rho - {x\; \cos \; \theta} - {u\; \sin \; \theta}} \right)}{x}{u}}}}} & (2)\end{matrix}$

where ρ is the distance from the coordinate system origin to the radialline; and θ is the angle corresponding to the angular orientation of theline. A projection of an image ƒ(x,u) at an angle θ can therefore be thesummation of its intensity along a radial line, which is positionedcorresponding to the value of (ρ,θ). Furthermore, δ( ) can be a Diracdelta function.

It is therefore readily apparent that each pixel of a transformed domaincan be associated with a unique line in the original image. RadonTransform 610 can map Cartesian coordinates into polar pixel coordinatesand replace the complex search for aligned topologically connectedclusters of pixels by the search for relative maxima in the transformdomain. These and other features account for distinct improvements overconventional techniques.

For example, given the task of detecting the slope or direction of linesfor Ray-Space interpolation, conventional BMI and PMI approaches employa procedure to find the matching blocks which is similar to that ofmotion search in video coding. Error matching may occur especially whenthe searching range is large. Therefore, obvious distortions typicallyoccur in the synthesized virtual view point image. In contrast, giveninherent properties of Radon transform 610 that naturally detect thedirection of lines in an image, the claimed subject matter can mitigatesuch obvious distortions in the synthesized virtual view point image.

Appreciably, Radon transform 610 can be applied to FEPI 106, which canbe constructed by feature extractor component 102 based upon EPI 218. Asdiscussed, EPI 218 is generally composed of multiple straight lines withdifferent slopes that respectively represent an inverse depth of acorresponding point in a scene. Accordingly, in an aspect of the claimedsubject matter, FEPI 106 can be generated by extracting feature points104 that exist at different depths in EPI 218. The possibleinterpolation direction for a given line (e.g., candidatedirections/slopes 612) can be reduced to a subset of candidates 614 byapplication of Radon transform 610 to FEPI 106.

In order to improve the reliability of results from Radon transform 610even further, in an aspect of the claimed subject matter, featureextractor component 102 can extract the set of feature points 104 fromEPI 218 based upon an intensity of a pixel that displays the scene point(e.g. based upon an intensity of pixel 214 that represents scene point208 of an image that in turn represents a portion 210 of real scene202). Intensity function 608. Feature extractor component 102 cantherefore extract feature points 104 according to intensity function608. For example, for each real view row u in EPI 218, FEPI 106 can begenerated by extracting feature points 104 from among the pixels withE(x,u)>0, where E(x,u)=ƒ(x+1,u)−ƒ(x,u):

$\begin{matrix}{{I\left( {x,u} \right)} = \left\{ \begin{matrix}{255,} & {{{{if}\mspace{14mu} {E\left( {x,u} \right)}} > {\overset{\_}{E} + \sqrt{\sigma_{E}^{2}}}};} \\{0,} & {{otherwise}.}\end{matrix} \right.} & (3)\end{matrix}$

Where Ē and σ_(E) ² can be the mean and variance of E(x,u),respectively, and where the points with I(x,u)=255 are feature points104. If several consecutive pixels in one row are extracted as featurepoints 104, the pixel with the largest E can be selected rather thanincluding all of the consecutive pixels. Accordingly, in an aspect ofthe claimed subject matter, feature extractor component 102 can select asingle representative feature point 104 from a substantially contiguousseries of feature points included in one row of EPI 218, wherein therepresentative feature point 104 can correspond to a pixel with alargest E, and where the single representative feature point 104 can beincluded in FEPI 106. Appreciably, feature extractor component 102 canfurther omit other feature points 104 included in the series from FEPI106, such as the non-representative feature points 104.

In accordance therewith, feature points 104 of each real view line inEPI 218 can thus be extracted. Moreover, in comparison to using absolutevalue of E(x,u) for selecting features, the claimed subject matter canprovide an additional advantage of a reduced number of parallel featurelines as well as improved reliability of the interpolation direction.

As described herein, Radon transform 610 can be applied to each FEPI 106to find the possible interpolation direction (e.g., candidates 614) ofthe corresponding EPI 218. And, additionally, Radon transform 610 of animage ƒ(x,u) at an angle θ can be the intensity summation along a radialline. Therefore, the local maximum peak (ρ,θ) in the parameter space cancorrespond to a possible line in FEPI 106 and a possible interpolationdirection can be calculated from the θ of an extracted peak.

It should be understood that some extracted peaks in the parameterdomain may be false peaks due, e.g., to erroneous edge detectionespecially when noise is present. Such false peaks do not correspond toany actual lines. Results of experimentation illustrate, however, thatthe values provided by Radon transform 610 usually have larger variationσ_(θ) ² along the true line direction. In accordance therewith, thevariance of a Radon transform 610 value in this direction is a truelocal maximum rather than a false peak. Therefore, according to anaspect of the claimed subject matter, interpolation component 108 canapply local maximum constraint 616 to local maxim in order to suppressfalse peaks, wherein constraint 616 can be

$\frac{^{2}\sigma_{\theta}^{2}}{\theta^{2}} > 0.$

As a result, the θ of the local maximum peaks meeting

$\frac{^{2}\sigma_{\theta}^{2}}{\theta^{2}} > 0$

in an on Radon Transform domain can be extracted and included incandidates 614, whereas false peaks can be omitted from candidates 614.

Furthermore, it was discovered that the number of feature points 104 ineach real view row of FEPI 106 can typically differ. However, the mediannumber, N, of feature points 104 per row can reflect the number offeature lines in EPI 218 more accurately. Therefore, the maximum numberof extracted local maximum peaks 618 can be set to N by, e.g.interpolation component 108. Experimentation verifies that utilizing Nmax 618, the candidate interpolation direction set 614 can be greatlyreduced, especially in the large search range case.

In an aspect of the claimed subject matter, interpolation component 108can further employ improved block matching interpolation technique 620,which is detailed infra. As previously described, conventional PMI andBMI techniques detect all the pixels within the preset search range tofind the optimal interpolation direction. If prior knowledge of ascene's depth ranges is provided, such that the smallest disparityd_(min) and largest disparity d_(max) between two real views r and r+k(supposing k−1 virtual views between two real views) is known inadvance, a reasonable search range for the PMI and BMI can be selected.It should be appreciated that d can be a distance between two matchingpixels in views i and i+k in x direction. For example, d can equal the xcoordinate of one of the matching pixels in view i+k minus that of theother matching pixel in view i. However, scenes can vary dramaticallyfrom one to another. Moreover, the disparities for many applications arenot known and cannot be reliably predicted in advance, so inconventional techniques d_(min) and d_(max) must be adjusted fordifferent situations, the necessary adjustments oftentimes cannot beknown in advance. Experimentation shows that the accuracy of d_(min) andd_(max) can greatly influence the interpolation results for conventionaltechniques.

Furthermore, even if d_(min) and d_(max) are known in advance, it isstill highly likely for conventional techniques to choose an incorrectmatching pair with smaller MSE than the true matching ones, especiallyin large search range cases. However, as described supra, Radontransform 610 can mitigate such difficulties and aid in omittingimpossible interpolation directions from the candidate direction set614. In accordance therewith, not only can the number of candidatedirections can be reduced, but performance can also be substantiallyimproved. Moreover, in an aspect of the claimed subject matter, only theview direction, specifically, from left to right or from right to theleft, is required to set the angle range of Radon transform 610.

In accordance with improved BMI 620, for a pixel at (x,r+i) to beinterpolated, where 1≦i≦k−1, the two nearest neighboring real views, rand r+k, can be employed as reference views. One or more 1D neighborhoodblocks can be defined for the two reference views, and the disparity dbetween the two reference views r and r+k can be calculated for a givendirection. Sum of square error (SSE) can be utilized as criteria tocalculate the distortion of block pairs in the two reference viewsaccording to:

$\begin{matrix}{{S\; S\; {E(d)}} = {\sum\limits_{l = {- W}}^{W}\left\lbrack {{f\left( {{x + {{\frac{k - i}{k}}d} + l},{r + k}} \right)} - {f\left( {{x - {{\frac{i}{k}}d} + l},r} \right)}} \right\rbrack^{2}}} & (4)\end{matrix}$

where, the block size can be 2W+1. Hence, the optimal disparity can bethe d in the candidate disparity set D that minimizes the SSE functionby:

$\begin{matrix}{d_{opt} = {\arg \; {\min\limits_{d \in D}{S\; S\; {E(d)}}}}} & (5)\end{matrix}$

For completeness, it should be noted that although the claimed subjectmatter can substantially reduce the probability incorrect matching by,e.g., removing the impossible interpolation directions, ambiguousresults might still be possible with the remaining candidate directions.Such a case exists because, while an objective of view interpolation isto find the true matching pairs for each point to be interpolated, theSSE criteria generally only minimize the distortion. Thus, an incorrectmatching pair can yield a smaller SSE than the true matching pairespecially in textureless cases. In order to mitigate, reduce, or removethese situations, some additional constraints can be added to furtherenhance improved BMI 620. As one example, interpolation component 108can remove a pixel from the candidate set, D, once the pixel has beenassociated with another pixel during interpolation. Appreciably, thislatter feature can exploit the uniqueness property of pixelcorrespondence. More specifically, for each pixel in one view, thereshould be at most one corresponding pixel in another view. For the pixelat (x,r+i) to be interpolated (1≦i≦k−1), given a candidate interpolationdirection, the x coordinate at reference view r (or r+k) can becalculated as

$x - {{\frac{i}{k}}d\mspace{11mu} {\left( {{{or}\mspace{14mu} x} + {{\frac{k - i}{k}}d}} \right).}}$

If the pixel at

$\left( {{x + {{\frac{k - i}{k}}d}},{r + k}} \right)\mspace{14mu} {or}\mspace{14mu} \left( {{x - {{\frac{i}{k}}d}},r} \right)$

has already been associated with another pixel with a reasonable SSE(e.g. smaller than a threshold which can be adaptive to block size),that pixel can be removed from the candidate direction set 612 andtherefore omitted from the subset 614.

Moreover, as further improvement over existing Ray-Space interpolationtechniques in which only the spatial correlation in a current EPI isconsidered, the claimed subject matter can also consider correlationbetween adjacent EPIs. This is possible since the corresponding rows inadjacent EPIs can actually be neighboring rows in the original set ofimage 602. Therefore, candidate direction set 614 contains not only thepossible directions detected in the current EPI 218, but also theoptimal ones inherited from the previous EPI 218. These and otherfeatures can improve the spatial continuity of a generated virtual viewin the vertical direction and at the same time reduce the impact causedby erroneous feature extraction.

FIGS. 7, 8, 9, and 10 illustrate various methodologies in accordancewith the claimed subject matter. While, for purposes of simplicity ofexplanation, the methodologies are shown and described as a series ofacts, it is to be understood and appreciated that the claimed subjectmatter is not limited by the order of acts, as some acts may occur indifferent orders and/or concurrently with other acts from that shown anddescribed herein. For example, those skilled in the art will understandand appreciate that a methodology could alternatively be represented asa series of interrelated states or events, such as in a state diagram.Moreover, not all illustrated acts may be required to implement amethodology in accordance with the claimed subject matter. Additionally,it should be further appreciated that the methodologies disclosedhereinafter and throughout this specification are capable of beingstored on an article of manufacture to facilitate transporting andtransferring such methodologies to computers. The term article ofmanufacture, as used herein, is intended to encompass a computer programaccessible from any computer-readable device, carrier, or media.

With reference now to FIG. 7, exemplary method 700 for facilitating freeview generation in Ray-Space in a more proficient manner by employing aRadon transform is illustrated. Generally, at reference numeral 702, aset of feature points can be extracted from an EPI, wherein a featurepoint can correspond to a scene point in an image of a scene.Appreciably, the scene point can represent a feature in a real view ofthe scene. This feature can be represented as a pixel in an image of thescene, and further represented as a line in the EPI. At referencenumeral 704, a FEPI can be created based upon the feature pointsextracted from the EPI at act 702.

Next, at reference numeral 706, the feature point can be mapped to aline in the FEPI, just as in the EPI any given pixel or point (asopposed to exclusively feature points) can be mapped to a line. Atreference numeral 708, a Radon transform can be applied to the FEPI forlimiting the members of a set of possible interpolation directions. Bylimiting the possible interpolation directions, the slope or directionof a line in the FEPI can be more accurately determined and virtualviews can be rendered with fewer errors.

Referring to FIG. 8, exemplary method 800 for constructing an EPI and/oran enhanced FEPI is depicted. Initially, at reference numeral 802, a setof images can be received. Typically, the received set of images depictsthe scene along disparate optical axes, wherein each optical axis canoriginate at a separate focal point. The set of images can therefore beprovided by a single camera that changes location or by an array ofcameras, each of which occupies a distinct location at a respectivefocal point.

At reference numeral 804, the EPI can be constructed by stackingtogether a set of epipolar lines included in one epipolar plane. Similarto act 706 where feature points can be mapped to lines in the FEPI, atreference numeral 806, each pixel in the image can be mapped to arespective epipolar line in the EPI, whereby a slope of the respectiveline can be a measure of inverse depth. In other words, the slope of therespective line can represent a distance from the focal point to thelocation of the real scene that an associated pixel represents.

Next, at reference numeral 808, the set of feature points extracted atact 704 can be further based upon an intensity of a pixel representingan associated scene point from the image. For example, for each realview row u in the EPI, the associated FEPI can be generated byextracting feature points from among the pixels with E(x,u)>0, whereE(x,u)=ƒ(x+1,u)−ƒ(x,u) in accordance with equation (3) provided supra.Accordingly, the points with I(x,u)=255 can be the feature points.

Moreover, at reference numeral 810, a representative feature point canbe selected from a substantially continuous series of feature pointsincluded in a row of the EPI, wherein the representative feature pointcan correspond to a highest intensity pixel. For example, if severalconsecutive pixels in one row are extracted as feature points, the pixelwith the largest E can be selected rather than including all of theconsecutive pixels. Appreciably, at reference numeral 812, therepresentative feature point can be included in the FEPI, whereas atreference numeral 814, non-representative feature points included in theseries can be omitted from the FEPI.

With reference now to FIG. 9, method 900 for providing additionalfeatures with respect to limiting a candidate set of directions isillustrated. Generally, at reference numeral 902, false peaks can besuppressed when applying the Radon transform described in connectionwith act 708. Suppression of false peaks can be accomplished byconstraining local maximum peaks to peaks that satisfy

$\frac{^{2}\sigma_{\theta}^{2}}{\theta^{2}} > 0.$

Such a constraint can operate to reduce false peaks given that thevalues provided by a Radon transform typically have larger variationσ_(θ) ² along the true line direction.

Furthermore, at reference numeral 904, a median number, N, of featurepoints per row for the EPI can be computed. Next, at reference numeral906, at most N local maximum peaks are extracted for further limitingthe members of the set of possible interpolation directions described atact 708. Since the median number of feature points per row can moreaccurately reflect the number of feature lines in the EPI, extracting Nfeature points can greatly reduce the candidate interpolationdirections.

Turning now to FIG. 10, method 1000 for providing an enhanced blockmatching technique for facilitating an interpolated virtual view isprovided. In particular, at reference numeral 1002, at least tworeference views can be selected from among real neighboring views. Suchreference views can be real views and denoted r and r+k. Furthermore,such reference views can be the nearest immediate neighbors of a virtualview. At reference numeral 1004, 1D neighboring blocks can be definedfor reference views r and r+k.

Next, at reference numeral 1006, a disparity, d, between reference viewsr and r+k can be computed for a given direction. Then, at referencenumeral 1008, a SSE function can be utilized for calculating distortionof block pairs in r and r+k, where block size is 2W+1 and the SSEfunction can be provided by equation (4) supra.

Thus, at reference numeral 1010, an optimal disparity, d_(opt), can bedetermined from amongst a candidate set, D, for minimizing the SSEfunction of act 908 according to equation (5) recited above. Finally, atreference numeral 1012, a pixel can be omitted from the candidate setwhen the pixel has been associated during previous interpolation. Inaccordance therewith, the candidate direction set can include not onlythe possible directions detected in the current EPI, but also theoptimal ones inherited from the previous EPI during interpolation.

Referring now to FIG. 11, there is illustrated a block diagram of anexemplary computer system operable to execute the disclosedarchitecture. In order to provide additional context for various aspectsof the claimed subject matter, FIG. 11 and the following discussion areintended to provide a brief, general description of a suitable computingenvironment 1100 in which the various aspects of the claimed subjectmatter can be implemented. Additionally, while the claimed subjectmatter described above may be suitable for application in the generalcontext of computer-executable instructions that may run on one or morecomputers, those skilled in the art will recognize that the claimedsubject matter also can be implemented in combination with other programmodules and/or as a combination of hardware and software.

Generally, program modules include routines, programs, components, datastructures, etc., that perform particular tasks or implement particularabstract data types. Moreover, those skilled in the art will appreciatethat the inventive methods can be practiced with other computer systemconfigurations, including single-processor or multiprocessor computersystems, minicomputers, mainframe computers, as well as personalcomputers, hand-held computing devices, microprocessor-based orprogrammable consumer electronics, and the like, each of which can beoperatively coupled to one or more associated devices.

The illustrated aspects of the claimed subject matter may also bepracticed in distributed computing environments where certain tasks areperformed by remote processing devices that are linked through acommunications network. In a distributed computing environment, programmodules can be located in both local and remote memory storage devices.

A computer typically includes a variety of computer-readable media.Computer-readable media can be any available media that can be accessedby the computer and includes both volatile and nonvolatile media,removable and non-removable media. By way of example, and notlimitation, computer-readable media can comprise computer storage mediaand communication media. Computer storage media can include bothvolatile and nonvolatile, removable and non-removable media implementedin any method or technology for storage of information such ascomputer-readable instructions, data structures, program modules orother data. Computer storage media includes, but is not limited to, RAM,ROM, EEPROM, flash memory or other memory technology, CD-ROM, digitalversatile disk (DVD) or other optical disk storage, magnetic cassettes,magnetic tape, magnetic disk storage or other magnetic storage devices,or any other medium which can be used to store the desired informationand which can be accessed by the computer.

Communication media typically embodies computer-readable instructions,data structures, program modules or other data in a modulated datasignal such as a carrier wave or other transport mechanism, and includesany information delivery media. The term “modulated data signal” means asignal that has one or more of its characteristics set or changed insuch a manner as to encode information in the signal. By way of example,and not limitation, communication media includes wired media such as awired network or direct-wired connection, and wireless media such asacoustic, RF, infrared and other wireless media. Combinations of the anyof the above should also be included within the scope ofcomputer-readable media.

With reference again to FIG. 11, the exemplary environment 1100 forimplementing various aspects of the claimed subject matter includes acomputer 1102, the computer 1102 including a processing unit 1104, asystem memory 1106 and a system bus 1108. The system bus 1108 couples tosystem components including, but not limited to, the system memory 1106to the processing unit 1104. The processing unit 1104 can be any ofvarious commercially available processors. Dual microprocessors andother multi-processor architectures may also be employed as theprocessing unit 1104.

The system bus 1108 can be any of several types of bus structure thatmay further interconnect to a memory bus (with or without a memorycontroller), a peripheral bus, and a local bus using any of a variety ofcommercially available bus architectures. The system memory 1106includes read-only memory (ROM) 1110 and random access memory (RAM)1112. A basic input/output system (BIOS) is stored in a non-volatilememory 1110 such as ROM, EPROM, EEPROM, which BIOS contains the basicroutines that help to transfer information between elements within thecomputer 1102, such as during start-up. The RAM 1112 can also include ahigh-speed RAM such as static RAM for caching data.

The computer 1102 further includes an internal hard disk drive (HDD)1114 (e.g., EIDE, SATA), which internal hard disk drive 1114 may also beconfigured for external use in a suitable chassis (not shown), amagnetic floppy disk drive (FDD) 1116, (e.g., to read from or write to aremovable diskette 1118) and an optical disk drive 1120, (e.g., readinga CD-ROM disk 1122 or, to read from or write to other high capacityoptical media such as the DVD). The hard disk drive 1114, magnetic diskdrive 1116 and optical disk drive 1120 can be connected to the systembus 1108 by a hard disk drive interface 1124, a magnetic disk driveinterface 1126 and an optical drive interface 1128, respectively. Theinterface 1124 for external drive implementations includes at least oneor both of Universal Serial Bus (USB) and IEEE1394 interfacetechnologies. Other external drive connection technologies are withincontemplation of the subject matter claimed herein.

The drives and their associated computer-readable media providenonvolatile storage of data, data structures, computer-executableinstructions, and so forth. For the computer 1102, the drives and mediaaccommodate the storage of any data in a suitable digital format.Although the description of computer-readable media above refers to aHDD, a removable magnetic diskette, and a removable optical media suchas a CD or DVD, it should be appreciated by those skilled in the artthat other types of media which are readable by a computer, such as zipdrives, magnetic cassettes, flash memory cards, cartridges, and thelike, may also be used in the exemplary operating environment, andfurther, that any such media may contain computer-executableinstructions for performing the methods of the claimed subject matter.

A number of program modules can be stored in the drives and RAM 1112,including an operating system 1130, one or more application programs1132, other program modules 1134 and program data 1136. All or portionsof the operating system, applications, modules, and/or data can also becached in the RAM 1112. It is appreciated that the claimed subjectmatter can be implemented with various commercially available operatingsystems or combinations of operating systems.

A user can enter commands and information into the computer 1102 throughone or more wired/wireless input devices, e.g. a keyboard 1138 and apointing device, such as a mouse 1140. Other input devices (not shown)may include a microphone, an IR remote control, a joystick, a game pad,a stylus pen, touch screen, or the like. These and other input devicesare often connected to the processing unit 1104 through an input deviceinterface 1142 that is coupled to the system bus 1108, but can beconnected by other interfaces, such as a parallel port, an IEEE1394serial port, a game port, a USB port, an IR interface, etc.

A monitor 1144 or other type of display device is also connected to thesystem bus 1108 via an interface, such as a video adapter 1146. Inaddition to the monitor 1144, a computer typically includes otherperipheral output devices (not shown), such as speakers, printers, etc.

The computer 1102 may operate in a networked environment using logicalconnections via wired and/or wireless communications to one or moreremote computers, such as a remote computer(s) 1148. The remotecomputer(s) 1148 can be a workstation, a server computer, a router, apersonal computer, portable computer, microprocessor-based entertainmentappliance, a peer device or other common network node, and typicallyincludes many or all of the elements described relative to the computer1102, although, for purposes of brevity, only a memory/storage device1150 is illustrated. The logical connections depicted includewired/wireless connectivity to a local area network (LAN) 1152 and/orlarger networks, e.g. a wide area network (WAN) 1154. Such LAN and WANnetworking environments are commonplace in offices and companies, andfacilitate enterprise-wide computer networks, such as intranets, all ofwhich may connect to a global communications network, e.g. the Internet.

When used in a LAN networking environment, the computer 1102 isconnected to the local network 1152 through a wired and/or wirelesscommunication network interface or adapter 1156. The adapter 1156 mayfacilitate wired or wireless communication to the LAN 1152, which mayalso include a wireless access point disposed thereon for communicatingwith the wireless adapter 1156.

When used in a WAN networking environment, the computer 1102 can includea modem 1158, or is connected to a communications server on the WAN1154, or has other means for establishing communications over the WAN1154, such as by way of the Internet. The modem 1158, which can beinternal or external and a wired or wireless device, is connected to thesystem bus 1108 via the serial port interface 1142. In a networkedenvironment, program modules depicted relative to the computer 1102, orportions thereof, can be stored in the remote memory/storage device1150. It will be appreciated that the network connections shown areexemplary and other means of establishing a communications link betweenthe computers can be used.

The computer 1102 is operable to communicate with any wireless devicesor entities operatively disposed in wireless communication, e.g., aprinter, scanner, desktop and/or portable computer, portable dataassistant, communications satellite, any piece of equipment or locationassociated with a wirelessly detectable tag (e.g., a kiosk, news stand,restroom), and telephone. This includes at least Wi-Fi and Bluetooth™wireless technologies. Thus, the communication can be a predefinedstructure as with a conventional network or simply an ad hoccommunication between at least two devices.

Wi-Fi, or Wireless Fidelity, allows connection to the Internet from acouch at home, a bed in a hotel room, or a conference room at work,without wires. Wi-Fi is a wireless technology similar to that used in acell phone that enables such devices, e.g., computers, to send andreceive data indoors and out; anywhere within the range of a basestation. Wi-Fi networks use radio technologies called IEEE802.11 (a, b,g, etc.) to provide secure, reliable, fast wireless connectivity. AWi-Fi network can be used to connect computers to each other, to theInternet, and to wired networks (which use IEEE802.3 or Ethernet). Wi-Finetworks operate in the unlicensed 2.4 and 5 GHz radio bands, at an 11Mbps (802.11b) or 54 Mbps (802.11a) data rate, for example, or withproducts that contain both bands (dual band), so the networks canprovide real-world performance similar to the basic “10BaseT” wiredEthernet networks used in many offices.

Referring now to FIG. 12, there is illustrated a schematic block diagramof an exemplary computer compilation system operable to execute thedisclosed architecture. The system 1200 includes one or more client(s)1202. The client(s) 1202 can be hardware and/or software (e.g., threads,processes, computing devices). The client(s) 1202 can house cookie(s)and/or associated contextual information by employing the claimedsubject matter, for example.

The system 1200 also includes one or more server(s) 1204. The server(s)1204 can also be hardware and/or software (e.g. threads, processes,computing devices). The servers 1204 can house threads to performtransformations by employing the claimed subject matter, for example.One possible communication between a client 1202 and a server 1204 canbe in the form of a data packet adapted to be transmitted between two ormore computer processes. The data packet may include a cookie and/orassociated contextual information, for example. The system 1200 includesa communication framework 1206 (e.g., a global communication networksuch as the Internet) that can be employed to facilitate communicationsbetween the client(s) 1202 and the server(s) 1204.

Communications can be facilitated via a wired (including optical fiber)and/or wireless technology. The client(s) 1202 are operatively connectedto one or more client data store(s) 1208 that can be employed to storeinformation local to the client(s) 1202 (e.g., cookie(s) and/orassociated contextual information). Similarly, the server(s) 1204 areoperatively connected to one or more server data store(s) 1210 that canbe employed to store information local to the servers 1204.

What has been described above includes examples of the variousembodiments. It is, of course, not possible to describe everyconceivable combination of components or methodologies for purposes ofdescribing the embodiments, but one of ordinary skill in the art mayrecognize that many further combinations and permutations are possible.Accordingly, the detailed description is intended to embrace all suchalterations, modifications, and variations that fall within the spiritand scope of the appended claims.

In particular and in regard to the various functions performed by theabove described components, devices, circuits, systems and the like, theterms (including a reference to a “means”) used to describe suchcomponents are intended to correspond, unless otherwise indicated, toany component which performs the specified function of the describedcomponent (e.g. a functional equivalent), even though not structurallyequivalent to the disclosed structure, which performs the function inthe herein illustrated exemplary aspects of the embodiments. In thisregard, it will also be recognized that the embodiments includes asystem as well as a computer-readable medium having computer-executableinstructions for performing the acts and/or events of the variousmethods.

In addition, while a particular feature may have been disclosed withrespect to only one of several implementations, such feature may becombined with one or more other features of the other implementations asmay be desired and advantageous for any given or particular application.Furthermore, to the extent that the terms “includes,” and “including”and variants thereof are used in either the detailed description or theclaims, these terms are intended to be inclusive in a manner similar tothe term “comprising.”

1. A system that facilitates more efficient free view generation inRay-Space, comprising: a feature extractor component that extracts a setof feature points from an epipolar plane image (EPI) and that constructsa feature epipolar plane image (FEPI) based upon the extracted set offeature points, a feature point corresponds to a scene point in an imageof a scene and is represented by a line in the FEPI; and aninterpolation component that applies a Radon transform to the FEPI inorder to determine a slope of the line.
 2. The system of claim 1, theinterpolation component employs the Radon transform to limit members ofa set of candidate interpolation slopes.
 3. The system of claim 1,further comprising a virtualization component that receives a set ofimages that depict the scene, each image respectively depicts the scenefrom a disparate focal point along an associated optical axis.
 4. Thesystem of claim 3, each optical axis is perpendicular to a baseline thatincludes each focal point and each optical axis is parallel to otheroptical axes.
 5. The system of claim 3, the virtualization componentaggregates a set of lines included in a single epipolar plane in orderto construct the EPI.
 6. The system of claim 3, the virtualizationcomponent maps the scene point to the line and the slope represents aninverse of the depth of the scene point whereby the depth is a measureof distance from a focal point to the scene point.
 7. The system ofclaim 1, each feature point included in the FEPI corresponds to a scenepoint at a disparate depth.
 8. The system of claim 5, the virtualizationcomponent applies a Gaussian filter to the received set of images inorder to smooth or minimize noise effects.
 9. The system of claim 1, thefeature extractor component extracts the set of feature points from theEPI based upon an intensity of a pixel that displays the scene point.10. The system of claim 9, the feature extractor component examines eachreal view row, denoted u, in the EPI in order to extract a feature pointthat corresponds to a pixel with E(x,u)>0, where E(x,u)=ƒ(x+1,u)−ƒ(x,u),and where ƒ relates to a function that describes an intensity value ofthe pixel.
 11. The system of claim 10, the set of feature pointsextracted by the feature extractor component and employed to constructthe FEPI correspond to pixels in the scene with I(x,u)=255, where:${I\left( {x,u} \right)} = \left\{ \begin{matrix}{255,} & {{{{if}\mspace{14mu} {E\left( {x,u} \right)}} > {\overset{\_}{E} + \sqrt{\sigma_{E}^{2}}}};} \\{0,} & {{otherwise}.}\end{matrix} \right.$
 12. The system of claim 10, the feature extractorcomponent selects a single representative feature point from asubstantially contiguous series of feature points included in one row ofthe EPI, the representative feature point corresponds to a pixel with alargest E, and the single representative feature point is included inthe FEPI.
 13. The system of claim 12, the feature extractor componentfurther omits other feature points included in the series from the FEPI.14. The system of claim 1, the interpolation component applies aconstraint of $\frac{^{2}\sigma_{\theta}^{2}}{\theta^{2}} > 0$ tolocal maxima in the Radon transform in order to suppress false peaks.15. The system of claim 14, the interpolation component omits falsepeaks from a set of candidate interpolation slopes in order to determinethe slope.
 16. The system of claim 1, the interpolation componentdetermines a number, N, where N represents a median number of featurepoints per row of the EPI, and the interpolation component further setsa maximum number of extracted local maximum peaks to N in order toreduce an amount of candidate slopes for the line.
 17. The system ofclaim 1, the interpolation component further employs an improved blockmatching interpolation technique in order to determine the slope for apixel that is interpolated
 18. The system of claim 17, the interpolationcomponent utilizes only a view direction to bound an angle range of theRadon transform, the view direction is one of from left to right or fromright to left.
 19. The system of claim 18, the interpolation componentselects two neighboring real views, r and r+k, as reference views forthe interpolated pixel located at (x,r+i), where 1≦i≦k−1, and further(1) defines 1D neighboring blocks for the two reference views, and (2)calculates a disparity, d, between the two reference views for a givendirection.
 20. The system of claim 19, the interpolation componentemploys a sum of squares error (SSE) function to compute distortion ofblock pairs in the two reference views.
 21. The system of claim 20, theinterpolation component applies the following SSE function:${{S\; S\; {E(d)}} = {\sum\limits_{l = {- W}}^{W}\left\lbrack {{f\left( {{x + {{\frac{k - i}{k}}d} + l},{r + k}} \right)} - {f\left( {{x - {{\frac{i}{k}}d} + l},r} \right)}} \right\rbrack^{2}}},$where block size is 2W+1.
 22. The system of claim 21, the interpolationcomponent determines an optimal disparity, d_(opt), from among thedisparity, d, of a candidate set, D, that minimizes the SSE functionaccording to:$d_{opt} = {\arg \; {\min\limits_{d \in D}{S\; S\; {{E(d)}.}}}}$23. The system of claim 22, the interpolation component removes a pixelfrom the candidate set, D once the pixel has been associated withanother pixel during interpolation.
 24. The system of claim 1 isincluded in a free viewpoint television or free viewpoint displaydevice.
 25. A method for facilitating free view generation in Ray-Spacein a more proficient manner, comprising: extracting a set of featurepoints from an EPI, a feature point corresponds to a scene point in animage of a scene; creating a FEPI based upon the extracted set offeature points; mapping the feature point to an line in the FEPI; andapplying a Radon transform to the FEPI for limiting the members of a setof possible interpolation directions.
 26. The method of claim 25,further comprising at least one of the following acts: receiving a setof images that depict the scene along disparate optical axes, each ofwhich originate at a separate focal point; constructing the EPI bystacking together a set of lines included in one epipolar plane; mappingeach pixel in the image to a respective line in the EPI whereby a slopeof the respective line is a measure of inverse depth; extracting the setof feature points is further based upon an intensity of a pixelrepresenting an associated scene point; selecting a representativefeature point from a substantially continuous series of feature pointsincluded in a row of the EPI, the representative feature pointcorresponds to a highest intensity pixel; including the representativefeature point in the FEPI; or omitting from the FEPI non-representativefeature points in the series.
 27. The method of claim 25, furthercomprising at least one of the following acts: suppressing false peakswhen applying the Radon transform by constraining local maximum peaks to${\frac{^{2}\sigma_{\theta}^{2}}{\theta^{2}} > 0};$ computing amedium number, N, of feature points per row for the EPI; or extractingat most N local maximum peaks for further limiting the members of theset of possible interpolation directions.
 28. The method of claim 25,further comprising at least one of the following acts: selecting atleast two reference views, r and r+k, from among real neighboring views;defining 1D neighboring blocks for reference views r and r+k; computinga disparity, d, between r and r+k for a given direction; utilizing a SSEfunction for calculating distortion of block pairs in r and r+k, whereblock size is 2W+1 and the SSE function is:${{S\; S\; {E(d)}} = {\sum\limits_{l = {- W}}^{W}\left\lbrack {{f\left( {{x + {{\frac{k - i}{k}}d} + l},{r + k}} \right)} - {f\left( {{x - {{\frac{i}{k}}d} + l},r} \right)}} \right\rbrack^{2}}};$determining an optimal disparity, d_(opt), from amongst a candidate set,D, for minimizing the SSE function according to:${d_{opt} = {\arg \; {\min\limits_{d \in D}{S\; S\; {E(d)}}}}};{or}$omitting a pixel from the candidate set when the pixel has beenassociated during interpolation;
 29. A system for facilitating free viewconstruction in Ray-Space in a more efficient manner, comprising: meansfor identifying a set of feature points from an EPI, a feature pointcorresponds to a scene point in an image of a scene; means forconstructing a FEPI from the set of feature points; means forassociating the feature point to an line in the FEPI; and means forapplying a Radon transform to the FEPI to reduce potential interpolationdirections.